A Mimetic Discretization of Elliptic Control Problems
نویسندگان
چکیده
In this paper we investigate the Mimetic Finite Difference method for the approximation of a constraint optimal control problem governed by an elliptic operator. A priori error estimates of the first order are derived in suitable discrete norms for both the control and the state variables. The theoretical results are confirmed by numerical experiments performed on a set of test cases selected from the literature.
منابع مشابه
MOX–Report No. 14/2010 A Mimetic Discretization of Elliptic Obstacle Problems
We develop a Finite Element method (FEM) which can adopt very general meshes with polygonal elements for the numerical approximation of elliptic obstacle problems. This kind of methods are also known as mimetic discretization schemes, which stem from the Mimetic Finite Di erence (MFD) method. The rst-order convergence estimate in a suitable (mesh-dependent) energy norm is established. Numerical...
متن کاملConvergence Analysis of the mimetic Finite Difference Method for Elliptic Problems with Staggered Discretizations of Diffusion Coefficients
We propose a family of mimetic discretization schemes for elliptic problems including convection and reaction terms. Our approach is an extension of the mimetic methodology for purely diffusive problems on unstructured polygonal and polyhedral meshes. The a priori error analysis relies on the connection between the mimetic formulation and the lowest order Raviart–Thomas mixed finite element met...
متن کاملHierarchical A Posteriori Error Estimators for the Mimetic Discretization of Elliptic Problems
We present an a posteriori error estimate of hierarchical type for the mimetic discretization of elliptic problems. Under a saturation assumption, the global reliability and efficiency of the proposed a posteriori estimator are proved. Several numerical experiments assess the actual performance of the local error indicators in driving adaptive mesh refinement algorithms based on different marki...
متن کاملMimetic Discretization of Elliptic PDE with Full Tensor Coefficients
This work concentrates upon the Mimetic discretization of elliptic partial differential equations (PDE). Numerical solutions are obtained and discussed for one-dimensional ODE on uniform and irregular grids and two-dimensional PDE on uniform grids. The focal point is to develop a scheme that incorporates the full tensor case on uniform grids in 2-D. The numerical results are then compared to pr...
متن کاملA Node Reconnection Algorithm for Mimetic Finite Difference Discretizations of Elliptic Equations on Triangular Meshes
Most efficient adaptive mesh methods employ only a few strategies, including local mesh refinement (h-adaptation), movement of mesh nodes (r-adaptation), and node reconnection (c-adaptation). Despite of its simplicity, node reconnection is the least popular of the three. However, using only node reconnection the discretization error can be significantly reduced. In this paper, we develop and nu...
متن کامل